Statistical mechanical systems on complete graphs, infinite exchangeability, finite extensions and a discrete finite moment problem
نویسندگان
چکیده
منابع مشابه
Statistical Mechanical Systems on Complete Graphs, Infinite Exchangeability, Finite Extensions and a Discrete Finite Moment Problem
We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic Curie–Weiss Ising model and includes as well all ferromagnetic Curie–Weiss Potts and Curie–Weiss Heisenberg models. By de Finetti’s theorem, this is equivalent to ...
متن کاملStatistical Mechanical Systems on Complete Graphs, Infinite Exchangeability, Finite Extensions and a Discrete Finite Moment Problem By
We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic Curie–Weiss Ising model and includes as well all ferromagnetic Curie–Weiss Potts and Curie–Weiss Heisenberg models. By de Finetti’s theorem, this is equivalent to ...
متن کاملComplexity and infinite games on finite graphs
This dissertation investigates the interplay between complexity, infinite games, and finite graphs. We present a general framework for considering two-player games on finite graphs which may have an infinite number of moves and we consider the computational complexity of important related problems. Such games are becoming increasingly important in the field of theoretical computer science, part...
متن کاملComputing Simulations on Finite and Infinite Graphs
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m 2 n). For effectively presented infinite graphs, we present a symbolic similarity-check...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2007
ISSN: 0091-1798
DOI: 10.1214/009117906000001033